Immune Memory in the Dynamic Clonal Selection Algor ithm
نویسندگان
چکیده
The dynamic clonal selection algorithm (DynamiCS) was created to tackle the difficulties of anomaly detection in continuously changing environments (Kim and Bentley, 2002). This paper describes an extension to the original algorithm, involving the deletion of memory detectors that are no longer valid. Experiments are performed on the extended system and results are analysed. The results show a marked decrease in false positive errors produced by the system. A real computer network produces new network traffi c continuously in real-time. Thus, normal behaviours of network traffic on one day can be different from no rmal behaviours of network traffic on another day. Prev ious work (Kim and Bentley, 2002), introduced the concep t of an artificial immune system (AIS) based on a dynamic clonal selection algorithm (DynamiCS) to tackle this type of problem. This system is capable of learning norm al behaviours by experiencing only a small subset of s elf antigens at one time. Its detectors were designed t o be replaced whenever previously observed normal behavioursnolongerrepresentedcurrentnormal behaviours. The results from experiments on this system (Kim an d Bentley, 2002) showed that DynamiCS could incrementally learn the globally converged distribu tions even though only one subset distribution was given at each generation. This feature was achieved by emplo ying three important parameters: tolerisation period ,activation threshold and life span. However, DynamiCS could not learn new self-antigens when learned self and non-s elf behaviours suddenly altered due to legal self chang e. This resulted in high false positive (FP) rates when new antigens were monitored by DynamiCS, although it produced high true positive (TP) rates. The proposed explanation of this outcome was that the generated memory detectors had never been exposed to certain antigen clusters within their tolerisation periods. Thus they could not have tolerance against a complete se lf set. This paper investigates a further extension of Dyna miCS, so that it can reduce FP rates increased by memory detectors. As one way to decrease the FP rates caus ed by memory detectors, the extended DynamiCS handles generated memory detectors based on their detection results. DynamiCS preserved memory detectors for an infinite lifespan. In contrast, the extended Dynami CS presented here kills memory detectors if they show poor self-tolerance to new antigens. This extended syste m is tested to see whether surviving memory detectors no longer cause seriously high FP error rates or not. From this test, an analysis …
منابع مشابه
Optimización en el Desempeño de Algoritmos de Detección de Complejos QRS
This document presents the implementation and the per formance evaluation of several algor ithms proposed for the detection of QRS complexes. Also, the optimization of the algor ithms is made maximizing the per formance measures of sensitivity and precision. An special emphasis is made for an hybr id algor ithm based on linear filter ing, Hilber t tr ans...
متن کاملProliferation of Antibody in Clonal Selection Algorithm with Immunological Memory Cell
The clonal selection principle explains the basic features of an adaptive immune response to a antigenic stimulus. It established the idea that only those cells that recognize the antigens are selected to proliferate and differentiate. This paper explains a computational implementation of the clonal selection principle that explicitly takes into account the affinity maturation of the immune res...
متن کاملA hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands
This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algo...
متن کاملAn Adaptive Algor ithm for Learning Changes in Run-Time Context Domain
The run-time context domain has much effect on the performance of practical corpus-based applications. Previous smoothing techniques, and class-based and similarity-based models cannot handle the dynamic status perfectly. In this paper, an adaptive learning algorithm is proposed for task adaptation to fit best the run-time context domain in the application of Chinese homophone disambiguation. I...
متن کاملAlgor ithm for image classification with over lapping classes
Abstr act. In this paper we propose an algorithm to raise the classification of satellite imagery that lets you work with non-homogeneous regions. There are different approaches for image classification using only pure classes. It is a motivation to develop a classifier for determining membership of the nonhomogeneous regions with more than one class. Soft Computing is used because of its abili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002